Soft-decision decoding offers a means of bridging the performance gap
نویسندگان
چکیده
Soft-decision decoding offers a means of bridging the performance gap between a block error-control system that uses hard-decision boundeddistance decoding, and one that uses maximum-likelihood decoding. Existing algorithms, however, tend to be complex in terms of hardware requirement. This paper presents a new class of soft-decision decoding algorithms, based on error-trapping decoding, which have a simpler hardware requirement in exchange for coding gain and ~ecoding delay trade-offs. In addition, a microprocessor-controlled implementation of these algorithms is described, and decoder performance and trade-offs under Gaussian noise
منابع مشابه
Soft-input soft-output decoding of variable length codes
We present a method for utilizing soft information in decoding of variable length codes (VLCs). When compared with traditional VLC decoding, which is performed using “hard” input bits and a state machine, the soft-input VLC decoding offers improved performance in terms of packet and symbol error rates. Soft-input VLC decoding is free from the risk, encountered in hard decision VLC decoders in n...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملAlgebraic Soft-Decision Decoding of Reed–Solomon Codes
A polynomial-time soft-decision decoding algorithm for Reed–Solomon codes is developed. This list-decoding algorithm is algebraic in nature and builds upon the interpolation procedure proposed by Guruswami and Sudan for hard-decision decoding. Algebraic soft-decision decoding is achieved by means of converting the probabilistic reliability information into a set of interpolation points, along w...
متن کاملMulti-stage Decoding for Multi-level Block Modulation Codes
In this paper, we investigate various types of multi-stage decoding for multi-level block modulation codes, in which the decoding of a component code at each stage can be either soft-decision or hard-decision, maximum likelihood or bounded-distance. Error performance of codes is analyzed for a memoryless additive channel based on various types of multi-stage decoding, and upper bounds on the pr...
متن کامل